Subtree Weight Ratios for Optimal Binary Search Trees
نویسندگان
چکیده
For an optimal binary search tree T with a subtree S(d) at a distance d from the root of T, we study the ratio of the weight of S(d) to the weight of T. The maximum possible value, which we call ρ(d), of the ratio of weights, is found to have an upper bound of 2/Fd+3 where Fi is the ith Fibonacci number. For d = 1, 2, 3, and 4, the bound is shown to be tight. For larger d, the Fibonacci bound gives ρ(d) = OP(φ) where φ ∝ .61803 is the golden ratio. By giving a particular set of optimal trees, we prove ρ(d) = Ω((.58578...)), and believe a similar proof follows for ρ(d) = Ω((.60179...)). If we include frequencies for unsuccessful searches in the optimal binary search trees, the Fibonacci bound is found to be tight.
منابع مشابه
The Coast of Searching in General Trees versus Complete Binary Trees
We consider the problem of searching in natural families of trees. A search in a tree T is a sequence of queries used to locate a pre-designated node called the \buggy" node. A query is made to any subtree in T. If the queried subtree contains the buggy node, then we restrict the search to that subtree, otherwise the search is restricted to the complement of that subtree in T. Two problems are ...
متن کاملSubtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depending on the size of the subtree. We introduce a new approach to this problem which helps us to further clarify this phenomenon. More precisely, we derive optimal Berry-Esseen bounds and local limit theorems for the norm...
متن کاملA Best Possible Bound for the Weighted Path Length of Binary Search Trees
The weighted path length of optimum binary search trees is bounded above by Y'./3i + 2 a. + H where H is the entropy of the frequency distribution, /3i is the total weight of the internal nodes, and aj is the total weight of the leaves. This bound is best possible. A linear time algorithm for constructing nearly optimal trees is described. One of the popular methods for retrieving information b...
متن کاملOptimal Binary Search Trees with Costs Depending on the Access Paths
We describe algorithms for constructing optimal binary search trees, in which the access cost to each key depends on the k preceeding keys which were reached in the path to the desired key. Two kinds of optimal trees are considered, namely optimal worst case and weighted average case trees. The time complexities of the corresponding algorithms are O(n k+2) and O(kn k+2) respectively, while the ...
متن کاملOptimal Search Trees with 2-Way Comparisons
We study the following problem: given a set of keys and access probabilities, find a minimum-cost binary search tree that uses only 2-way comparisons (=, <,≤) at each node. We give the first polynomialtime algorithm when both successful and unsuccessful queries are allowed, settling a long-standing open question. Our algorithm relies on a new structural theorem that proves a conjecture of Spule...
متن کامل